Accurate and Interpretable Factorization Machines
نویسندگان
چکیده
منابع مشابه
Learning Accurate, Compact, and Interpretable Tree Annotation
We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting with a simple Xbar grammar, we learn a new grammar whose nonterminals are subsymbols of the original nonterminals. In contrast with previous work, we are able to split various terminals to different degrees, as approp...
متن کاملExtracting Interpretable Models from Matrix Factorization Models
Matrix factorization models have been successfully used in many real-world tasks, such as knowledge base completion and recommendation systems. However, explaining the causes that elicit a particular prediction by a manual inspection of its latent representations is a difficult task. In this paper we try to overcome this problem by exploring descriptive model classes in their ability to faithfu...
متن کاملInterpretable Matrix Factorization with Stochastic Nonnegative DEDICOM
Decomposition into Directed Components (DEDICOM) is a special matrix factorization technique to factorize a given asymmetric similarity matrix into a combination of a loading matrix describing the latent structures in the data and an asymmetric affinity matrix encoding the relationships between the found latent structures. Finding DEDICOM factors can be cast as a matrix norm minimization proble...
متن کاملInterpretable Sparse High-Order Boltzmann Machines
Fully-observable high-order Boltzmann Machines are capable of identifying explicit highorder feature interactions theoretically. However, they have never been used in practice due to their prohibitively high computational cost for inference and learning. In this paper, we propose an efficient approach for learning a fully-observable high-order Boltzmann Machine based on sparse learning and cont...
متن کاملInterpretable support vector machines for functional data
Support Vector Machines (SVM) has been shown to be a powerful nonparametric classification technique even for high-dimensional data. Although predictive ability is important, obtaining an easy-to-interpret classifier is also crucial in many applications. Linear SVM provides a classifier based on a linear score. In the case of functional data, the coefficient function that defines such linear sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33014139